Disjunctive Systems and L-Domains

نویسنده

  • Guo-Qiang Zhang
چکیده

Disjunctive systems are a representation of L-domains. They use sequents of the form X ` Y , with X nite and Y pairwise disjoint. We show that for any disjunctive system, its elements ordered by inclusion form an L-domain. On the other hand, via the notion of stable neighborhoods, every L-domain can be represented as a disjunctive system. More generally, we have a categorical equivalence between the category of disjunctive systems and the category of L-domains. A natural classiication of domains is obtained in terms of the style of the entailment: when jXj = 2 and jY j = 0 disjunctive systems determine coherent spaces; when jY j 1 they represent Scott domains; when either jXj = 1 or jY j = 0 the associated cpos are distributive Scott domains; and nally, without any restriction, disjunctive systems give rise to L-domains.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A logical approach to stable domains

Building on earlier work by Guo-Qiang Zhang on disjunctive information systems, and by Thomas Ehrhard, Pasquale Malacaria, and the first author on stable Stone duality, we develop a framework of disjunctive propositional logic in which theories correspond to algebraic L-domains. Disjunctions in the logic can be indexed by arbitrary sets (as in geometric logic) but must be provably disjoint. Thi...

متن کامل

A duality between fuzzy domains and strongly completely distributive $L$-ordered sets

The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...

متن کامل

Compositional Optimization of Disjunctive Abstract Interpretations

We define the inverse operation for disjunctive completion, introducing the notion of least disjunctive basis for an abstract domain D: this is the most abstract domain inducing the same disjunctive completion as D. We show that the least disjunctive basis exists in most cases, and study its properties in relation with reduced product of abstract interpretations. The resulting framework is powe...

متن کامل

An Information-system Representation of the Smyth Powerdomain

This paper provides a representation of the Smyth powerdomain as information systems. A new notion of ideal elements, called disjunctive states, is introduced. Disjunctive states are built from clauses over the token set of the underlying information system in order to represent disjunctive information. At the heart of this representation is a hyperresolution rule, whose completeness hinges upo...

متن کامل

An elementary proof that upper and lower powerdomain constructions commute

It was proved in [1] that lower and upper powerdomain constructions commute on all domains. In that proof, domains were represented as information systems. In [2] a rather complicated algebraic proof was given which relied on universality properties of powerdomains proved in the previous works of the author of [2]. Here we give an elementary algebraic proof that upper and lower powerdomain cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992